Convergence of relaxed parallel multisplitting methods
نویسندگان
چکیده
منابع مشابه
Non - Stationary Parallel Multisplitting Aor Methods ∗
Non-stationary parallel multisplitting iterative methods based on the AOR method are studied for the solution of nonsingular linear systems. Convergence of the synchronous and asyn-chronous versions of these methods is studied for H–matrices. Furthermore, computational results about these methods on both shared and distributed memory multiprocessors are discussed. The numerical examples present...
متن کاملParallel multisplitting methods for singular linear systems
In this paper, we discuss convergence of the extrapolated iterative methods for linear systems with the coefficient matrices are singular H-matrices. And we present the sufficient and necessary conditions for convergence of the extrapolated iterative methods. Moreover, we apply the results to the GMAOR methods. Finally, we give one numerical example. Keywords—singular H-matrix, linear systems, ...
متن کاملConvergence of non-stationary parallel multisplitting methods for hermitian positive definite matrices
Non-stationary multisplitting algorithms for the solution of linear systems are studied. Convergence of these algorithms is analyzed when the coefficient matrix of the linear system is hermitian positive definite. Asynchronous versions of these algorithms are considered and their convergence investigated.
متن کاملGRPM-style methods and comparisons of convergent and divergent rates
Relaxed technique is one of techniques for improving convergence rate of splitting iterative methods. Based on local relaxed method and system relaxed method of parallel multisplitting Frommer andMayer [A. Frommer, G. Mayer, Convergence of relaxed parallel multisplitting methods, Linear Algebra Appl. 119 (1989) 141–152], we give the global relaxed parallel multisplitting (GRPM) method by introd...
متن کاملNonstationary Relaxed Multisplitting Methods for Solving Linear Complementarity Problems with H−matrices
In this paper we consider some non stationary relaxed synchronous and asynchronous multisplitting methods for solving the linear complementarity problems with their coefficient matrices being H−matrices. The convergence theorems of the methods are given,and the efficiency is shown by numerical tests.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1989
ISSN: 0024-3795
DOI: 10.1016/0024-3795(89)90074-8